Length-factoriality and pure irreducibility
نویسندگان
چکیده
An atomic monoid $M$ is called length-factorial if for every non-invertible element $x \in M$, no two distinct factorizations of $x$ into irreducibles have the same length (i.e., number irreducible factors, counting repetitions). The notion length-factoriality was introduced by J. Coykendall and W. Smith in 2011 under term 'other-half-factoriality': they used to provide a characterization unique factorization domains. In this paper, we study more general context commutative, cancellative monoids. addition, properties related length-factoriality, namely, PLS property (recently Chapman et al.) bi-length-factoriality semirings.
منابع مشابه
Meromorphic Functions and Factoriality
Let K be a compact subset of a connected Stein manifold X. We study algebraic properties of the ring of meromorphic functions on X without poles in K.
متن کاملThe Irreducibility of Certain Pure-cycle Hurwitz Spaces
We study “pure-cycle” Hurwitz spaces, parametrizing covers of the projective line having only one ramified point over each branch point. We start with the case of genus-0 covers, using a combination of limit linear series theory and group theory to show that these spaces are always irreducible. In the case of four branch points, we also compute the associated Hurwitz numbers. Finally, we give a...
متن کاملOn Factoriality of Cox Rings
Generalized Cox’s construction associates with an algebraic variety a remarkable invariant – its total coordinate ring, or Cox ring. In this note we give a new proof of factoriality of the Cox ring when the divisor class group of the variety is finitely generated and free. The proof is based on a notion of graded factoriality. We show that if the divisor class group has torsion, then the Cox ri...
متن کاملFactoriality of q-Gaussian von Neumann algebras
We prove that the von Neumann algebras generated by n q-Gaussian elements, are factors for n > 2.
متن کاملClique Irreducibility and Clique Vertex Irreducibility of Graphs
A graphs G is clique irreducible if every clique in G of size at least two, has an edge which does not lie in any other clique of G and is clique reducible if it is not clique irreducible. A graph G is clique vertex irreducible if every clique in G has a vertex which does not lie in any other clique of G and clique vertex reducible if it is not clique vertex irreducible. The clique vertex irred...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Algebra
سال: 2023
ISSN: ['1532-4125', '0092-7872']
DOI: https://doi.org/10.1080/00927872.2023.2187629